Strongly Minimal Sets and Geometry
ثبت نشده
چکیده
منابع مشابه
Zero sets in pointfree topology and strongly $z$-ideals
In this paper a particular case of z-ideals, called strongly z-ideal, is defined by introducing zero sets in pointfree topology. We study strongly z-ideals, their relation with z-ideals and the role of spatiality in this relation. For strongly z-ideals, we analyze prime ideals using the concept of zero sets. Moreover, it is proven that the intersection of all zero sets of a prime ideal of C(L),...
متن کاملLecture notes on strongly minimal sets (and fields) with a generic automorphism
These lecture notes develop the theory of strongly minimal sets with a generic automorphism. They are strongly influenced by, and in some sense an exposition of the papers [1] and [2] which look at the case of algebraically closed fields with an automorphism. The deepest parts of these latter papers are concerned with dichotomy theorems (a type of SU -rank 1 is locally modular or nonorthogonal ...
متن کاملSome new properties of fuzzy strongly ${{g}^{*}}$-closed sets and $delta {{g}^{*}}$-closed sets in fuzzy topological spaces
In this paper, a new class of fuzzy sets called fuzzy strongly ${{g}^{*}}$-closed sets is introduced and its properties are investigated. Moreover, we study some more properties of this type of closed spaces.
متن کاملModel theory and Kähler geometry
We survey and explain some recent work at the intersection of model theory and bimeromorphic geometry (classification of compact complex manifolds). Included here are the essential saturation of the many-sorted structure C of Kähler manifolds, the conjectural role of hyperkähler manifolds in the description of strongly minimal sets in C, and Campana’s work on the isotriviality of hyperkähler fa...
متن کاملNumber of Minimal Path Sets in a Consecutive-k-out-of-n: F System
In this paper the combinatorial problem of determining the number of minimal path sets of a consecutive-k-out-of-n: F system is considered. For the cases where k = 2, 3 the explicit formulae are given and for k ≥ 4 a recursive relation is obtained. Direct computation for determining the number of minimal path sets of a consecutive-k-out-of-n: F system for k ≥ 4 remains a difficult task. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998